PROTEIN STRUCTURE–STRUCTURE ALIGNMENT WITH DISCRETE FRÉCHET DISTANCE

Protein Local Structure Alignment Under the Discrete Fréchet Distance

Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very few results are known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the ...

On the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance

Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very little is known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous...

Approximability of the Discrete Fréchet Distance

The Fréchet distance is a popular and widespread distance measure for point sequences and for curves. About two years ago, Agarwal et al [SIAM J. Comput. 2014] presented a new (mildly) subquadratic algorithm for the discrete version of the problem. This spawned a flurry of activity that has led to several new algorithms and lower bounds. In this paper, we study the approximability of the discre...

Computing the Discrete Fréchet Distance with Imprecise Input

We consider the problem of computing the discrete Fréchet distance between two polygonal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in arbitrary fixed dimension, we present an algorithm for this problem that returns in time O(mn log(mn)) the Fréchet distance lower ...

Following a curve with the discrete Fréchet distance